Linear languages of finite and infinite words

DOI10.1142/9789814317610_0003zbMATH Open1264.68092OpenAlexW2317215946MaRDI QIDQ4922671FDOQ4922671

Authors: Masami Ito, Zoltán Ésik, W. Kuich 

Publication date: 3 June 2013

Published in: Automata, Formal Languages and Algebraic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814317610_0003

Recommendations

• Büchi context-free languages
• Context-Free Languages of Countable Words
• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
• Linearly bounded infinite graphs
• Finite automata

zbMATH Keywords

linear grammarConway semiring-semimodule pair

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Semirings (16Y60)

Cited In (4)

• Middle quotients of linear languages
• A descriptive characterisation of even linear languages
• Counting Finite Languages by Total Word Length
• Büchi context-free languages

This page was built for publication: Linear languages of finite and infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922671)