Concise representations of regular languages by degree and probabilistic finite automata
From MaRDI portal
Publication:3142004
DOI10.1007/BF01189856zbMath0782.68083OpenAlexW1983940475MaRDI QIDQ3142004
Kong-Yee Pun, Detlef Wotschke, Chandra M. R. Kintala
Publication date: 9 December 1993
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01189856
Related Items
IN MEMORIAM CHANDRA KINTALA ⋮ On the descriptional complexity of finite automata with modified acceptance conditions ⋮ Branching Measures and Nearly Acyclic NFAs ⋮ Transforming a single-valued transducer into a Mealy machine
Cites Work
- Unnamed Item
- Unnamed Item
- On Goedel speed-up and succinctness of language representations
- Succinct representation of regular languages by Boolean automata. II
- The complexity properties of probabilistic automata with isolated cut point
- Amounts of nondeterminism in finite automata
- Succinct representation of regular languages by Boolean automata
- Degree-languages: A new concept of acceptance
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- On the power of bounded concurrency I
- Probabilistic automata