Janusz A. Brzozowski (1962):
Regular Expression Techniques for Sequential Circuits.
Princeton University, Princeton, NJ, USA.
Janusz A. Brzozowski, Galina Jirásková & C. Zou (2014):
Quotient complexity of closed languages.
Theory of Computing Systems 54,
pp. 277–292,
doi:10.1007/s00224-013-9515-7.
Jürgen Dassow (1979):
On the circular closure of languages.
Elektronische Informationsverarbeitung und Kybernetik/Journal of Information Processing and Cybernetics 15(1–2),
pp. 87–94.
Jürgen Dassow, Florin Manea & Bianca Truthe (2011):
On contextual grammars with subregular selection languages.
In: Markus Holzer, Martin Kutrib & Giovanni Pighizzini: Descriptional Complexity of Formal Systems – 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25\,–\,27, 2011. Proceedings,
LNCS 6808.
Springer-Verlag,
pp. 135–146,
doi:10.1007/978-3-642-22600-7_11.
Jürgen Dassow & Gheorghe Păun (1989):
Regulated Rewriting in Formal Language Theory.
EATCS Monographs in Theoretical Computer Science 18.
Springer-Verlag,
doi:10.1007/978-3-642-74932-2.
Jürgen Dassow, Ralf Stiebe & Bianca Truthe (2009):
Two collapsing hierarchies of subregularly tree controlled languages.
Theoretical Computer Science 410(35),
pp. 3261–3271,
doi:10.1016/j.tcs.2009.03.005.
Jürgen Dassow, Ralf Stiebe & Bianca Truthe (2010):
Generative capacity of subregularly tree controlled grammars.
International Journal of Foundations of Computer Science 21(5),
pp. 723–740,
doi:10.1142/S0129054110007520.
Jürgen Dassow & Bianca Truthe (2008):
On two hierarchies of subregularly tree controlled languages.
In: Cezar Câmpeanu & Giovanni Pighizzini: Descriptional Complexity of Formal Systems, 10th International Workshop, Charlottetown, Prince Edward Island, Canada, July 16–18, 2008, Proceedings.
University of Prince Edward Island,
pp. 145–156.
Jürgen Dassow & Bianca Truthe (2008):
Subregularly tree controlled grammars and languages.
In: Erzsébet Csuhaj-Varjú & Zoltán Ésik: Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27–30, 2008, Proceedings.
Computer and Automation Research Institute, Hungarian Academy of Sciences,
pp. 158–169.
Jürgen Dassow & Bianca Truthe (2022):
On the generative capacity of contextual grammars with strictly locally testable selection languages.
In: Henning Bordihn, Géza Horváth & György Vaszil: 12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022), Debrecen, Hungary, August 26\,–\,27, 2022. Proceedings,
EPTCS 367.
Open Publishing Association,
pp. 65–80,
doi:10.4204/EPTCS.367.5.
Ferenc Gécseg & István Peák (1972):
Algebraic Theory of Automata.
Academiai Kiado, Budapest.
Arthur Gill & Lawrence T. Kou (1974):
Multiple-entry finite automata.
Journal of Computer and System Sciences 9(1),
pp. 1–19,
doi:10.1016/S0022-0000(74)80034-6.
Ivan M. Havel (1969):
The theory of regular events II.
Kybernetika 5(6),
pp. 520–544.
Markus Holzer & Bianca Truthe (2015):
On relations between some subregular language families.
In: Rudolf Freund, Markus Holzer, Nelma Moreira & Rogério Reis: Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA), Porto, Portugal, August 31 – September 1, 2015, Proceedings,
books@ocg.at 318.
Österreichische Computer Gesellschaft,
pp. 109–124.
John E. Hopcroft & Jeffrey D. Ullman (1979):
Introduction to Automata Theory, Languages, and Computation.
Addison-Wesley, Reading.
Karel Čulik II & Hermann A. Maurer (1977):
Tree controlled grammars.
Computing 19(2),
pp. 129–139,
doi:10.1007/BF02252350.
Sige Yuki Kuroda (1964):
Classes of languages and linear bounded automata.
Information and Control 7(2),
pp. 207–223,
doi:10.1016/S0019-9958(64)90120-2.
Robert McNaughton & Seymour Papert (1971):
Counter-Free Automata.
MIT Press, Cambridge, USA.
Micha A. Perles, Michael O. Rabin & Eliahu Shamir (1963):
The theory of definite automata.
IEEE Trans. Electronic Computers 12,
pp. 233–243,
doi:10.1109/PGEC.1963.263534.
Gheorghe Păun (1979):
On the generative capacity of tree controlled grammars.
Computing 21,
pp. 213–220,
doi:10.1007/BF02253054.
Stefano Crespi Reghizzi & Pierluigi San Pietro (2011):
From regular to strictly locally testable languages.
In: Petr Ambrož, Štěpán Holub & Zuzana Masáková: 8th International Conference WORDS 2011,
EPTCS 63,
pp. 103–111,
doi:10.4204/EPTCS.63.14.
Grzegorz Rozenberg & Arto Salomaa (1980):
The Mathematical Theory of L Systems.
Academic Press.
Grzegorz Rozenberg & Arto Salomaa (1997):
Handbook of Formal Languages.
Springer-Verlag, Berlin.
Huei-Jan Shyr (1991):
Free Monoids and Languages.
Hon Min Book Co., Taichung, Taiwan.
Huei-Jan Shyr & Gabriel Thierrin (1974):
Ordered automata and associated languages.
Tankang Journal of Mathematics 5(1),
pp. 9–20.
Huei-Jan Shyr & Gabriel Thierrin (1974):
Power-separating regular languages.
Mathematical Systems Theory 8(1),
pp. 90–95,
doi:10.1007/BF01761710.
Ralf Stiebe (2008):
On the complexity of the control language in tree controlled grammars.
In: Jürgen Dassow & Bianca Truthe: Colloquium on the Occasion of the 50th Birthday of Victor Mitrana, Otto-von-Guericke-Universitäat Magdeburg, Germany, June 27, 2008, Proceedings.
Otto-von-Guericke-Universitäat Magdeburg, Germany,
pp. 29–36.
Bianca Truthe (2018):
Hierarchy of Subregular Language Families.
Technical Report.
Justus-Liebig-Universität Giessen, Institut für Informatik, IFIG Research Report 1801.
Sherzod Turaev, Jürgen Dassow, Florin Manea & Mohd Hasan Selamat (2012):
Language classes generated by tree controlled grammars with bounded nonterminal complexity.
Theoretical Computer Science 449,
pp. 134–144,
doi:10.1016/j.tcs.2012.04.013.
György Vaszil (2012):
On the nonterminal complexity of tree controlled grammars.
In: Henning Bordihn, Martin Kutrib & Bianca Truthe: Languages Alive – Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday,
LNCS 7300.
Springer,
pp. 265–272,
doi:10.1007/978-3-642-31644-9_18.
Barbara Wiedemann (1978):
Vergleich der Leistungsfähigkeit endlicher determinierter Automaten.
Diplom\-arbeit.
Universität Rostock.
eptcs@eptcs.org