Families of automata characterizing context-sensitive languages

DOI10.1007/S00236-004-0160-0zbMath1067.68086OpenAlexW2003484715MaRDI QIDQ1772107

Christophe Morvan, Chloé Rispal

Publication date: 15 April 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-004-0160-0

zbMATH Keywords

synchronized rational graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Traces of term-automatic graphs

Cites Work

• Synchronized rational relations of finite and infinite words
• The theory of ends, pushdown automata, and second-order logic
• On the transition graphs of Turing machines.
• On infinite transition graphs having a decidable monadic theory
• One-sided and two-sided context in formal grammars
• On Relations Defined by Generalized Finite Automata
• Three models for the description of language
• Studies in abstract families of languages
• Classes of languages and linear-bounded automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Families of automata characterizing context-sensitive languages