Transductions and the parallel generation of languages†

DOI10.1080/00207168308803348zbMath0503.68057OpenAlexW2164661693MaRDI QIDQ3969888

Karel II Culik, Tom Head

Publication date: 1983

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168308803348

zbMATH Keywords

decidabilityL-systemsparallel rewritingfinite transducersglobal context

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Abstract grammars based on transductions

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Codeterministic Lindenmayer schemes and systems
• Context-free grammars with selective rewriting
• A-transducers and the monotonicity of IL schemes
• Single-valued a-transducers
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Transductions and the parallel generation of languages^†