Families of automata characterizing context-sensitive languages
type: Item
instance of: scholarly article
title: Families of automata characterizing context-sensitive languages
zbMATH Open document ID: 1067.68086
author: Christophe Morvan
author: Chloé Rispal
published in: Acta Informatica
publication date: 2005-04-15T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2156257
zbMATH Keywords: synchronized rational graphs
MaRDI profile type: Publication
full work available at URL: s00236-004-0160-0
OpenAlex ID: W2003484715
cites work: On the transition graphs of Turing machines.
cites work: On infinite transition graphs having a decidable monadic theory
cites work: Three models for the description of language
cites work: Q4737148
cites work: Q4385531
cites work: On Relations Defined by Generalized Finite Automata
cites work: Synchronized rational relations of finite and infinite words
cites work: Classes of languages and linear-bounded automata
cites work: Q4508307
cites work: Q4779172
cites work: The theory of ends, pushdown automata, and second-order logic
cites work: One-sided and two-sided context in formal grammars
cites work: The synchronized graphs trace the context-sensitive languages
cites work: Studies in abstract families of languages
cites work: Q4412132
DOI: 10.1007/S00236-004-0160-0
Recommended article: Context-sensitive languages and G-automata
Recommended article: An Automata Characterisation for Multiple Context-Free Languages
Recommended article: Context free closed families of languages
Recommended article: Q4939012
Recommended article: Characterization of context-free languages
Recommended article: An Automata-Theoretical Characterization of Context-Free Trace Languages
Recommended article: Q3761716
Recommended article: Q4782102
Recommended article: DM-automata and classes of context-free languages
Recommended article: A new characterization of nondeterministically recognizable families of languages
description: scientific article; zbMATH DE number 2156257