Concise representations of regular languages by degree and probabilistic finite automata

DOI10.1007/BF01189856zbMATH Open0782.68083OpenAlexW1983940475MaRDI QIDQ3142004FDOQ3142004

Kong-Yee Pun, Chandra M. R. Kintala, Detlef Wotschke

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

zbMATH Keywords

probabilistic automatafinite automataregular languagesdegree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Probabilistic automata
• Title not available (Why is that?)
• Amounts of nondeterminism in finite automata
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• On Goedel speed-up and succinctness of language representations
• On the power of bounded concurrency I
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Succinct representation of regular languages by Boolean automata
• Succinct representation of regular languages by Boolean automata. II
• Degree-languages: A new concept of acceptance
• The complexity properties of probabilistic automata with isolated cut point
• Title not available (Why is that?)

Cited In (8)

• Transforming a single-valued transducer into a Mealy machine
• Title not available (Why is that?)
• On the descriptional complexity of finite automata with modified acceptance conditions
• In memoriam Chandra Kintala
• Title not available (Why is that?)
• Bideterministic Automata and Minimal Representations of Regular Languages
• Branching Measures and Nearly Acyclic NFAs
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Succinct representations for (non)deterministic finite automata 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Bideterministic automata and minimal representations of regular languages 👍 👎
• Bideterministic Automata and Minimal Representations of Regular Languages 👍 👎

This page was built for publication: Concise representations of regular languages by degree and probabilistic finite automata

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