Coverart for item
The Resource Automata, languages, and programming : 19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings, W. Kuich (ed.)

Automata, languages, and programming : 19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings, W. Kuich (ed.)

Label
Automata, languages, and programming : 19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings
Title
Automata, languages, and programming
Title remainder
19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings
Statement of responsibility
W. Kuich (ed.)
Contributor
Subject
Genre
Language
eng
Summary
This volume presents the proceedings of the 19th International Colloquium onAutomata, Languages, and Programming (ICALP 92) in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP is a broadly based conference covering all aspects of theoretical computer science, including such topics as computability, automata, formal languages, term rewriting, analysis of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography, data types and data structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design andlayout, parallel and distributed computation, theory of concurrency, and theory of robotics. The papers in the volume are grouped into thematic parts corresponding to their order of presentation at ICALP 92
Member of
Action
digitized
Cataloging source
OCLCE
Dewey number
005.13/1
Illustrations
illustrations
Index
index present
LC call number
QA267
LC item number
.A9233 1992
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1941-
http://library.link/vocab/relatedWorkOrContributorName
Kuich, Werner
Series statement
Lecture notes in computer science
Series volume
623
http://library.link/vocab/subjectName
  • Machine theory
  • Formal languages
  • Computer programming
  • Automates mathématiques, Théorie des
  • Langages formels
  • Programmation (Informatique)
  • Computer programming
  • Formal languages
  • Machine theory
  • Programmiersprache
  • Automatentheorie
  • Kongress
  • Automates mathématiques, Théorie des
  • Ordinateurs
  • Langages formels
Label
Automata, languages, and programming : 19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings, W. Kuich (ed.)
Instantiates
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Abelian Squares Are Avoidable on 4 Letters
  • V. Keranen.
  • Polynomial Size Test Sets for Context-Free Languages
  • J. Karhumaki, W. Plandowski and W. Rytter.
  • Quasi-Deterministic OL Systems
  • T.Y. Nishida.
  • On Growing Context-Sensitive Languages
  • G. Buntrock and K. Lorys
  • Finite Automata (Session 3).
  • Numeration Systems, Linear Recurrences, and Regular Sets
  • Complexity (Session 1).
  • J. Shallit.
  • The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
  • D. Krob.
  • Semi-Commutations and Rational Expressions
  • M. Clerbout, M. Latteux, Y. Roos and W. Zielonka.
  • New Results Concerning Synchronized Finite Automata
  • O.H. Ibarra and N.Q. Tran
  • Graph Grammars and Complexity (Session 4).
  • A Greibach Normal Form for Context-Free Graph Grammars
  • J. Engelfriet.
  • Philosophical Issues in Kolmogorov Complexity (Invited Lecture)
  • On Reverse and General Definite Tree Languages
  • P. Peladeau and A. Podelski.
  • Reductions to Sets of Low Information Content
  • V. Arvind, Y. Han, L. Hemachandra, J. Kobler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schoning, R. Silvestri and T. Thierauf
  • M. Li and P.M.B. Vitanyi.
  • Circuit Complexity and the Expressive Power of Generalized First-Order Formulas
  • H. Straubing.
  • One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier
  • A. De Santis, G. Persiano and M. Yung
  • Formal Languages (Session 2).
Control code
682229852
Dimensions
unknown
Extent
1 online resource (xii, 719 pages)
Form of item
online
Isbn
9783540472780
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)682229852
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Label
Automata, languages, and programming : 19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings, W. Kuich (ed.)
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Abelian Squares Are Avoidable on 4 Letters
  • V. Keranen.
  • Polynomial Size Test Sets for Context-Free Languages
  • J. Karhumaki, W. Plandowski and W. Rytter.
  • Quasi-Deterministic OL Systems
  • T.Y. Nishida.
  • On Growing Context-Sensitive Languages
  • G. Buntrock and K. Lorys
  • Finite Automata (Session 3).
  • Numeration Systems, Linear Recurrences, and Regular Sets
  • Complexity (Session 1).
  • J. Shallit.
  • The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
  • D. Krob.
  • Semi-Commutations and Rational Expressions
  • M. Clerbout, M. Latteux, Y. Roos and W. Zielonka.
  • New Results Concerning Synchronized Finite Automata
  • O.H. Ibarra and N.Q. Tran
  • Graph Grammars and Complexity (Session 4).
  • A Greibach Normal Form for Context-Free Graph Grammars
  • J. Engelfriet.
  • Philosophical Issues in Kolmogorov Complexity (Invited Lecture)
  • On Reverse and General Definite Tree Languages
  • P. Peladeau and A. Podelski.
  • Reductions to Sets of Low Information Content
  • V. Arvind, Y. Han, L. Hemachandra, J. Kobler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schoning, R. Silvestri and T. Thierauf
  • M. Li and P.M.B. Vitanyi.
  • Circuit Complexity and the Expressive Power of Generalized First-Order Formulas
  • H. Straubing.
  • One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier
  • A. De Santis, G. Persiano and M. Yung
  • Formal Languages (Session 2).
Control code
682229852
Dimensions
unknown
Extent
1 online resource (xii, 719 pages)
Form of item
online
Isbn
9783540472780
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)682229852
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...