Algebraic and graph-theoretic properties of infiniten-posets

DOI10.1051/ita:2005018zbMath1102.68060OpenAlexW2164628380MaRDI QIDQ4680742

Zoltán L. Németh, Zoltán Ésik

Publication date: 7 June 2005

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_1_305_0

Mathematics Subject Classification ID

Partial orders, general (06A06) Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Free algebras (08B20)

Related Items (1)

Axiomatizing the identities of binoid languages

Cites Work

• The equational theory of pomsets
• Regular binoid expressions and regular binoid languages.
• Series-parallel languages and the bounded-width property
• Rationality in algebras with a series operation
• Towards a language theory for infinite N-free pomsets.
• The Recognition of Series Parallel Digraphs
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic and graph-theoretic properties of infiniten-posets