Prefix and equality languages of rational functions are co-context-free
From MaRDI portal
Publication:1124356
DOI10.1016/0020-0190(88)90167-6zbMATH Open0678.68066OpenAlexW1966523679MaRDI QIDQ1124356FDOQ1124356
Authors: Joost Engelfriet, Hendrik Jan Hoogeboom 
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90167-6
Recommendations
- scientific article; zbMATH DE number 5051550
- Publication:4502584
- Equality sets of prefix morphisms and regular star languages
- Infinitary axiomatization of the equational theory of context-free languages
- Infinitary axiomatization of the equational theory of context-free languages
- On the commutative equivalence of context-free languages
- Notes on congruence relations and factor pumping conditions for rational languages
- A syntactic congruence for rational \(\omega\)-languages
- scientific article
- On the Expressive Power of Equality-Free First Order Languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on finite-valued and finitely ambiguous transducers
- What makes some language theory problems undecidable
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- Title not available (Why is that?)
- Every iterated morphism yields a co-CFL
- An infinite square-free co-CFL
- Two-way counter machines and finite-state transducers†
- Equality languages and fixed point languages
Cited In (2)
This page was built for publication: Prefix and equality languages of rational functions are co-context-free
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124356)
