scientific article; zbMATH DE number 2087217
From MaRDI portal
Publication:4737901
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (13)
Some properties of the Fibonacci sequence on an infinite alphabet ⋮ On Boolean closed full trios and rational Kripke frames ⋮ The synthesis of Petri nets from path-automatic specifications ⋮ Bounded model checking of infinite state systems ⋮ Arithmetics properties of substitutions and infinite automata ⋮ Verification of opacity and diagnosability for pushdown systems ⋮ Linearly bounded infinite graphs ⋮ Morphisms on infinite alphabets, countable states automata and regular sequences ⋮ Unary Automatic Graphs: An Algorithmic Perspective ⋮ Unnamed Item ⋮ An Infinite Automaton Characterization of Double Exponential Time ⋮ On complexity functions of infinite words associated with generalized Dyck languages ⋮ The Reachability Problem over Infinite Graphs
This page was built for publication:
