Finite automata for languages of combinatorial interest: An order theoretical point of view

DOI10.1016/0166-218X(92)90288-LzbMath0679.68144OpenAlexW2094897334MaRDI QIDQ1823003

Rodica Simion

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90288-l

zbMATH Keywords

permutationslanguagepartially ordered setminimum finite automaton

Mathematics Subject Classification ID

Partial orders, general (06A06) Formal languages and automata (68Q45)

Related Items (1)

Partially ordered sets associated with permutations

Cites Work

• Partially ordered sets associated with permutations
• Restricted permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite automata for languages of combinatorial interest: An order theoretical point of view