Borrow it
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.)

Creator
Contributor
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."--PUBLISHER'S WEBSITE
  • "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."--PUBLISHER'S WEBSITE
Language
eng
Work
Publication
Extent
xii, 719 pages
Note
Proceedings of ICALP 92, the 19th International Colloquium on Automata, Languages, and Programming, sponsored by the European Association for Theoretical Computer Science
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).
Isbn
9783540557197
Instance
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.)
Creator
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."--PUBLISHER'S WEBSITE
  • "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."--PUBLISHER'S WEBSITE
Member of
Cataloging source
DLC
Illustrations
illustrations
Index
index present
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1992
http://bibfra.me/vocab/lite/meetingName
International Colloquium on Automata, Languages, and Programming
Nature of contents
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
Label
Automata, languages, and programming : 19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings, W. Kuich (ed.)
Instantiates
Publication
Note
Proceedings of ICALP 92, the 19th International Colloquium on Automata, Languages, and Programming, sponsored by the European Association for Theoretical Computer Science
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
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
26095705
Dimensions
25 cm
Extent
xii, 719 pages
Isbn
9783540557197
Isbn Type
(acid-free paper)
Lccn
92021890
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
(WaOLN)1453435
Label
Automata, languages, and programming : 19th international colloquium, Wien, Austria, July 13-17, 1992 : proceedings, W. Kuich (ed.)
Publication
Note
Proceedings of ICALP 92, the 19th International Colloquium on Automata, Languages, and Programming, sponsored by the European Association for Theoretical Computer Science
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
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
26095705
Dimensions
25 cm
Extent
xii, 719 pages
Isbn
9783540557197
Isbn Type
(acid-free paper)
Lccn
92021890
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
(WaOLN)1453435

Subject

Genre

Member of

Library Locations

    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
    • University of Missouri Libraries DepositoryBorrow it
      2908 Lemone Blvd, Columbia, MO, 65211, US
      38.919360 -92.291620

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...