Context-Sensitive Languages, Rational Graphs and Determinism
نویسندگان
چکیده
منابع مشابه
Context-Sensitive Languages, Rational Graphs and Determinism
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an initial vertex to a final vertex. In 2001, Morvan and Stirling proved that rational graphs accept the context-sensitive languages between rational sets of initia...
متن کاملRational Graphs Trace Context-Sensitive Languages
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
متن کاملThe synchronized graphs trace the context-sensitive languages
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result is still true if we restrict to the traces of graphs defined by synchronized transducers with labelled final states. From their construction, we deduce that the context-sensitive languages are the languages of path lab...
متن کاملCharacterizations of Context-Sensitive Languages
We give “syntactic” characterizations of context-sensitive languages (CSLs) in terms of some restricted models of symport/antiport P systems. These are the first such characterizations of CSLs in terms of P systems. In particular, we show the following for any language L over a binary alphabet: 1. Let m be any integer ≥ 1. Then L is a CSL if and only if it can be accepted by a restricted sympor...
متن کاملParsing of Context-Sensitive Languages
This art icle presents some ideas from parsing Context-Sensit ive languages. Introduces Scattered-Context grammars and languages and describes usage of such grammars to parse CS languages. Also there are presented additional results fronr type checking and formal prograrn verification using CS parsing. I{eywords: Turing Machines, Parsing of Context-Sensitive Languages, Fornral Program Verificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2006
ISSN: 1860-5974
DOI: 10.2168/lmcs-2(2:6)2006