Prefix and equality languages of rational functions are co-context-free
From MaRDI portal
(Redirected from Publication:1124356)
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; zbMATH DE number 3874640
- On the Expressive Power of Equality-Free First Order Languages
Cites work
- scientific article; zbMATH DE number 4028926 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- A note on finite-valued and finitely ambiguous transducers
- An infinite square-free co-CFL
- Equality languages and fixed point languages
- Every iterated morphism yields a co-CFL
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- Two-way counter machines and finite-state transducers†
- What makes some language theory problems undecidable
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)
