Developments in Language Theory C

38 papers

YearTitle / Authors
2003Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers
Masami Ito, Masafumi Toyama
2002A Remark about Quadratic Trace Equations.
Volker Diekert, Manfred Kufleitner
2002A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines.
Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang
2002A Unique Structure of Two-Generated Binary Equality Sets.
Stepan Holub
2002Abstract Families of Graphs.
Tanguy Urvoy
2002An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton.
Hiroshi Umeo, Naoki Kamikawa
2002An Inverse Automata Algorithm for Recognizing 2-Collapsing Words.
Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov
2002Automata on Linear Orderings.
Véronique Bruyère, Olivier Carton
2002Automaton Representation of Linear Conjunctive Languages.
Alexander Okhotin
2002Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata.
Hendrik Jan Hoogeboom
2002Characteristic Semigroups of Directable Automata.
Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic
2002Circular Words Avoiding Patterns.
James D. Currie, D. Sean Fitzpatrick
2002Computational Processes in Living Cells: Gene Assembly in Ciliates.
Tero Harju, Grzegorz Rozenberg
2002Constructing Infinite Words of Intermediate Complexity.
Julien Cassaigne
2002Decision Problems for Linear and Circular Splicing Systems.
Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri, Rosalba Zizza
2002Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Sigma
Kostyantyn Archangelsky
2002Efficient Transformations from Regular Expressions to Finite Automata.
Sebastian Seibert
2002Experimental Quantum Computation with Molecules.
Masahiro Kitagawa
2002Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators.
Zoltán Ésik
2002Finite Automata Models of Quantized Systems: Conceptual Status and Outlook.
Karl Svozil
2002Finite Completion of Comma-Free Codes. Part I.
Nguyen Huong Lam
2002Improved Bounds on the Number of Automata Accepting Finite Languages.
Michael Domaratzki
2002Infinite Snake Tiling Problems.
Jarkko Kari
2002Innermost Termination of Context-Sensitive Rewriting.
Jürgen Giesl, Aart Middeldorp
2002On Deterministic Finite Automata and Syntactic Monoid Size.
Markus Holzer, Barbara König
2002On a Family of Codes with Bounded Deciphering Delay.
Do Long Van, Igor Litovsky
2002On the Descriptional Complexity of Some Variants of Lindenmayer Systems.
Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel
2002On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities.
Henry N. Adorna
2002On the Structure of Graphic DLI-Sets.
László Kászonyi
2002On-Line Odometers for Two-Sided Symbolic Dynamical Systems.
Christiane Frougny
2002Roots and Powers of Regular Languages.
Sándor Horváth, Peter Leupold, Gerhard Lischke
2002Safety Verification for Two-Way Finite Automata with Monotonic Counters.
Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun
2002Some Properties of Ciliate Bio-operations.
Mark Daley, Lila Kari
2002Some Remarks on Asynchronous Automata.
Balázs Imreh
2002The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.
Frédérique Bassino, Julien Clément, Cyril Nicaud
2002Tiling Systems over Infinite Pictures and Their Acceptance Conditions.
Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle
2002Unary Language Operations and Their Nondeterministic State Complexity.
Markus Holzer, Martin Kutrib
2002Undecidability of Weak Bisimilarity for PA-Processes.
Jirí Srba