scientific article; zbMATH DE number 2102748
From MaRDI portal
Publication:4818835
zbMath1045.03509MaRDI QIDQ4818835
Publication date: 24 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)
Related Items (22)
Automatic graphs and D0L-sequences of finite graphs ⋮ Simple monadic theories and partition width ⋮ Complexity results on branching-time pushdown model checking ⋮ Linearly bounded infinite graphs ⋮ Rewriting Higher-Order Stack Trees ⋮ Rewriting higher-order stack trees ⋮ The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic ⋮ On the transition graphs of Turing machines. ⋮ Automata-based Representations for Infinite Graphs ⋮ Analyzing pushdown systems with stack manipulation ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Model checking the full modal mu-calculus for infinite sequential processes ⋮ An Infinite Automaton Characterization of Double Exponential Time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Logical aspects of Cayley-graphs: the group case ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ Regular sets over extended tree structures ⋮ Deciding regular grammar logics with converse through first-order logic ⋮ Model checking the full modal mu-calculus for infinite sequential processes
This page was built for publication:
