Deterministic finite automata with recursive calls and DPDAs

DOI10.1016/S0020-0190(03)00281-3zbMath1161.68527OpenAlexW2019603173MaRDI QIDQ1014418

Salvatore La Torre, Supratik Mukhopadhyay, Jean H. Gallier

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00281-3

zbMATH Keywords

formal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Enhancing active model learning with equivalence checking using simulation relations

Cites Work

• Statecharts: a visual formalism for complex systems
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• Strict deterministic grammars
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• The equivalence problem for deterministic pushdown automata is decidable
• Transition network grammars for natural language analysis
• Decidability of DPDA equivalence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic finite automata with recursive calls and DPDAs