Concise representations of regular languages by degree and probabilistic finite automata

DOI10.1007/BF01189856MaRDI QIDQ3142004zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

probabilistic automatafinite automataregular languagesdegree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3856433
• Approximating probabilistic automata by regular languages
• scientific article; zbMATH DE number 7699973
• scientific article; zbMATH DE number 6136496
• Succinct representations for (non)deterministic finite automata
• scientific article; zbMATH DE number 3963203
• scientific article; zbMATH DE number 7439745
• scientific article; zbMATH DE number 3860398
• Bideterministic automata and minimal representations of regular languages
• Bideterministic Automata and Minimal Representations of Regular Languages

Cites work

• scientific article; zbMATH DE number 3963203 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• Amounts of nondeterminism in finite automata
• Degree-languages: A new concept of acceptance
• On Goedel speed-up and succinctness of language representations
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• On the power of bounded concurrency I
• Probabilistic automata
• 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
• The complexity properties of probabilistic automata with isolated cut point

Cited in

(9)

• Transforming a single-valued transducer into a Mealy machine
• scientific article; zbMATH DE number 1283994 (Why is no real title available?)
• On the descriptional complexity of finite automata with modified acceptance conditions
• Branching measures and nearly acyclic NFAs
• In memoriam Chandra Kintala
• scientific article; zbMATH DE number 6136496 (Why is no real title available?)
• Bideterministic Automata and Minimal Representations of Regular Languages
• scientific article; zbMATH DE number 3963203 (Why is no real title available?)
• scientific article; zbMATH DE number 7439745 (Why is no real title available?)

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)