Publication:4737901
From MaRDI portal
zbMath1073.68671MaRDI QIDQ4737901
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2295/22950130.htm
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
03B25: Decidability of theories and sets of sentences
Related Items
Unnamed Item, Linearly bounded infinite graphs, On complexity functions of infinite words associated with generalized Dyck languages, Morphisms on infinite alphabets, countable states automata and regular sequences, The synthesis of Petri nets from path-automatic specifications, Some properties of the Fibonacci sequence on an infinite alphabet, On Boolean closed full trios and rational Kripke frames, Bounded model checking of infinite state systems, Arithmetics properties of substitutions and infinite automata, Verification of opacity and diagnosability for pushdown systems, The Reachability Problem over Infinite Graphs, Unary Automatic Graphs: An Algorithmic Perspective, An Infinite Automaton Characterization of Double Exponential Time