Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata-Reference-Cited by-同舟云学术

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata

Published:2010 Issue: Volume: Page:1-23
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Holzer Markus,Kutrib Martin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15349-5_1.pdf

Reference71 articles.

1. Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)

2. Lecture Notes in Computer Science;H. Björklund,2008

3. Borchardt, I.: Nonrecursive tradeoffs between context-free grammars with different constant ambiguity. Diploma thesis, Universität Frankfurt (1992) (in German)

4. Cho, S., Huynh, D.T.: The parallel complexity of finite-state automata problems. Inform. Comput. 97, 1–22 (1992)

5. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct;Logical Methods in Computer Science;2024-01-11

2. Photonic realization of a quantum finite automaton;Physical Review Research;2020-01-28

3. Non-Recursive Trade-Offs Are “Almost Everywhere”;Computing with Foresight and Industry;2019

4. Operations on Unambiguous Finite Automata;International Journal of Foundations of Computer Science;2018-08

5. Worst Case Branching and Other Measures of Nondeterminism;International Journal of Foundations of Computer Science;2017-04