Non-erasing Variants of the Chomsky–Schützenberger Theorem

DOI10.1007/978-3-642-31653-1_12zbMath1370.68211OpenAlexW107365663MaRDI QIDQ3167489

Alexander Okhotin

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_12

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (7)

Consensus Game Acceptors ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ Consensus Game Acceptors and Iterated Transductions ⋮ LIMITED AUTOMATA AND REGULAR LANGUAGES ⋮ Limited automata and unary languages ⋮ Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet ⋮ Epsilon-reducible context-free languages and characterizations of indexed languages

This page was built for publication: Non-erasing Variants of the Chomsky–Schützenberger Theorem