On a question of Eggan
From MaRDI portal
Publication:5609399
DOI10.1016/S0019-9958(66)90083-0zbMath0209.02903WikidataQ56061216 ScholiaQ56061216MaRDI QIDQ5609399
Publication date: 1966
Published in: Information and Control (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Algebraic theory of languages and automata (68Q70)
Related Items (16)
Unnamed Item ⋮ Distance desert automata and the star height problem ⋮ Concatenation hierarchies: new bottle, old wine ⋮ Algorithms for determining relative star height and star height ⋮ Inversion height in free fields ⋮ Techniques for establishing star height of regular sets ⋮ Determinism and non-determinism in PDL ⋮ Unnamed Item ⋮ Algorithms for determining relative inclusion star height and inclusion star height ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Group presentations, formal languages and characterizations of one- counter groups ⋮ Generic results for concatenation hierarchies ⋮ On well quasi orders of free monoids ⋮ Der programmierbare endliche Automat. (The programmable finite automaton) ⋮ General properties of star height of regular events ⋮ Star height of certain families of regular events
This page was built for publication: On a question of Eggan
