On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
- Weitere Titel
-
Über die relative Beschreibungskomplexität regulärer Ausdrücke und endlicher Automaten
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Trier, Universität Trier, Dissertation, 2011
- Schlagwort
-
Sequential machine theory
Automatentheorie
Gerichteter Graph
Reduktionssystem
Regulärer Ausdruck
Minor
- Ereignis
-
Veröffentlichung
- (wo)
-
Trier
- (wer)
-
Universität Trier
- (wann)
-
2012
- Urheber
-
Gulan, Stefan
- Beteiligte Personen und Organisationen
-
Fernau, Henning
- URN
-
urn:nbn:de:hbz:385-7283
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Gulan, Stefan
- Fernau, Henning
- Universität Trier
Entstanden
- 2012
Ähnliche Objekte (12)
Transformation Between Regular Expressions and omega-Automata
Finite automata, formal logic, and circuit complexity
Tight bounds on the descriptional complexity of regular expressions
State Complexity of Basic Operations on Nondeterministic Finite Automata
Finite automata, their algebras, and grammars : towards a theory of formal expressions
Re-Discovering Python's Regular Expressions
Regular path expressions in feature logic
Simplifying regular expressions : A quantitative perspective
Regular path expressions in feature logic
Self-Assembling Finite Automata
A note on the computational complexity of some problems for self-verifying finite automata
Finite automata encoding geometric figures
Transformation Between Regular Expressions and omega-Automata
Finite automata, formal logic, and circuit complexity
Tight bounds on the descriptional complexity of regular expressions
State Complexity of Basic Operations on Nondeterministic Finite Automata
Finite automata, their algebras, and grammars : towards a theory of formal expressions
Re-Discovering Python's Regular Expressions
Regular path expressions in feature logic
Simplifying regular expressions : A quantitative perspective
Regular path expressions in feature logic
Self-Assembling Finite Automata
A note on the computational complexity of some problems for self-verifying finite automata
Finite automata encoding geometric figures
Transformation Between Regular Expressions and omega-Automata
Finite automata, formal logic, and circuit complexity
Tight bounds on the descriptional complexity of regular expressions
State Complexity of Basic Operations on Nondeterministic Finite Automata
Finite automata, their algebras, and grammars : towards a theory of formal expressions
Re-Discovering Python's Regular Expressions
Regular path expressions in feature logic
Simplifying regular expressions : A quantitative perspective
Regular path expressions in feature logic
Self-Assembling Finite Automata
A note on the computational complexity of some problems for self-verifying finite automata