Automata on series-parallel biposets

DOI10.1007/3-540-46011-X_18MaRDI QIDQ4737909zbMATH OpenFDO

Authors Zoltán Németh, Zoltán Ésik

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2295/22950217.htm

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2143010
• Automata on infinite biposets
• Series-parallel posets: Algebra, automata and languages
• Infinite series-parallel posets: Logic and languages
• Series-parallel languages on scattered and countable posets

Cited in

(7)

• Towards a language theory for infinite N-free pomsets.
• Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
• Algebraic and graph-theoretic properties of infiniten-posets
• Enumerated BSP Automata
• Series-parallel languages on scattered and countable posets
• Automata on infinite biposets

This page was built for publication: Automata on series-parallel biposets

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