Publication:4818835
From MaRDI portal
zbMath1045.03509MaRDI QIDQ4818835
Publication date: 24 September 2004
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03B25: Decidability of theories and sets of sentences
Related Items
Automata-based Representations for Infinite Graphs, Logical aspects of Cayley-graphs: the group case, Regular sets over extended tree structures, Linearly bounded infinite graphs, Decidability of bisimulation equivalence for normed pushdown processes, On the transition graphs of Turing machines., Automatic graphs and D0L-sequences of finite graphs, Model checking the full modal mu-calculus for infinite sequential processes, Complexity results on branching-time pushdown model checking, Rewriting higher-order stack trees, Deciding regular grammar logics with converse through first-order logic, Unnamed Item, Unnamed Item, Unnamed Item, Simple monadic theories and partition width, Rewriting Higher-Order Stack Trees, A Hierarchy of Automaticω-Words having a Decidable MSO Theory, An Infinite Automaton Characterization of Double Exponential Time, An Automata-Theoretic Approach to Infinite-State Systems