Search results for author `Truthe'

Search performed on http://theo.cs.ovgu.de/pubs/procart_y.html.

BIANCA TRUTHE:: Merging Two Hierarchies of External Contextual Grammars with Subregular Selection.
In: HENNING BORDIHN, NICHOLAS TRAN, GYÖRGY VASZIL (eds.), 25th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings. LNCS 13918, Springer, 2023, 169–180.
BIANCA TRUTHE:: Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection.
In: BENEDEK NAGY, RUDOLF FREUND (eds.), Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications Famagusta, North Cyprus, 18th–19th September, 2023. EPTCS 388, Open Publishing Association, 2023, 125–139.
BIANCA TRUTHE:: Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars.
In: ZSOLT GAZDAG, SZABOLCS IVÁN, GERGELY KOVÁSZNAI (eds.), Proceedings of the 16th International Conference on Automata and Formal Languages, Eger, Hungary, September 5–7, 2023. EPTCS 386, Open Publishing Association, 2023, 253–268.
JÜRGEN DASSOW, BIANCA TRUTHE:: On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages.
In: HENNING BORDIHN, GÉZA HORVÁTH, GYÖRGY VASZIL (eds.), Twelveth Workshop on Non-Classical Models of Automata and Applications (NCMA), Debrecen, Hungary, August 26–27, 2022, Proceedings. EPTCS 367, Open Publishing Association, 2022, 65–80.
JÜRGEN DASSOW, BIANCA TRUTHE:: On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages.
In: HENNING BORDIHN (ed.), 32. Theorietag `Automaten und Formale Sprachen', Caputh, 19.–21. September 2022. Technischer Bericht, Universität Potsdam, 2022, 29–34.
BIANCA TRUTHE:: A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors.
In: JÉRÔME DURAND-LOSE, GYÖRGY VASZIL (eds.), Machines, Computations, and Universality; 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 – September 2, 2022, Proceedings. LNCS 13419, Springer, 2022, 12–26.
BIANCA TRUTHE:: Accepting Networks of Evolutionary Processors with Resources Restricted Filters.
In: RUDOLF FREUND, MARKUS HOLZER, JOSÉ M. SEMPERE (eds.), 11th Workshop on Non-Classical Models of Automata and Applications (NCMA), Valencia, Spain, July 2–3, 2019, Proceedings. books@ocg.at 336, Österreichische Computer Gesellschaft, Austria, 2019, 187–202.
BIANCA TRUTHE:: Accepting Networks of Evolutionary Processors with Resources Restricted Filters.
In: SEBASTIAN MANETH (ed.), 29. Theorietag `Automaten und Formale Sprachen', Bremen, 25.–27. September 2019. Technischer Bericht der AG Datenbanken, Universität Bremen, 2019, 28–31.
BIANCA TRUTHE:: Networks of Evolutionary Processors with Resources Restricted Filters.
In: RUDOLF FREUND, MICHAL HOSPODÁR, GALINA JIRASKOVÁ, GIOVANNI PIGHIZZINI (eds.), 10th Workshop on Non-Classical Models of Automata and Applications (NCMA), Košice, Slovakia, August 21–22, 2018. Proceedings. books@ocg.at 332, Österreichische Computer Gesellschaft, Austria, 2018, 165–180.
BIANCA TRUTHE:: Networks of Evolutionary Processors with Resources Restricted Filters.
In: KLAUS REINHARDT, LUDWIG STAIGER, RENATE WINTER (eds.), 28. Theorietag `Automaten und Formale Sprachen', Wittenberg, 24.–27. September 2018. Technischer Bericht 18-1, Martin-Luther-Universität Halle-Wittenberg, 2018, 78–81.
BIANCA TRUTHE:: Hierarchies of Language Families of Contextual Grammars.
In: RUDOLF FREUND, FRANTISEK MRÁZ, DANIEL PRŮSA (eds.), 9th Workshop on Non-Classical Models of Automata and Applications (NCMA), Prague, Czech Republic, August 17–18, 2017. Proceedings. books@ocg.at 329, Österreichische Computer Gesellschaft, Austria, 2017, 13–28.
WAN HENG FONG, MARKUS HOLZER, BIANCA TRUTHE, SHERZOD TURAEV, AHMAD FIRDAUS YOSMAN:: On Bonded Sequential and Parallel Insertion Systems.
In: HENNING BORDIHN, RUDOLF FREUND, BENEDEK NAGY, GYöRGY VASZIL (eds.), 8th Workshop on Non-Classical Models of Automata and Applications (NCMA), Debrecen, Hungary, August 29–30, 2016, Proceedings. books@ocg.at 321, Österreichische Computer Gesellschaft, Austria, 2016, 163–178.
WAN HENG FONG, MARKUS HOLZER, BIANCA TRUTHE, SHERZOD TURAEV, AHMAD FIRDAUS YOSMAN:: On Bonded Sequential and Parallel Insertion Systems.
In: FLORIN MANEA, DIRK NOWOTKA, THOMAS WILKE (eds.), 26. Theorietag `Automaten und Formale Sprachen', Aukrug, 4.–7. Oktober 2016. Berichte Institut für Informatik 1606, Christian-Albrechts-Universität zu Kiel, 2016, 45–48.
AHMAD FIRDAUS YOSMAN, MARKUS HOLZER, BIANCA TRUTHE, WAN HENG FONG, SHERZOD TURAEV:: Two Variants of Bonded Parallel Insertion Systems and Their Generative Power.
In: 6th International Graduate Conference on Engineering, Science, and Humanities (IGCESH), Johor Bahru, Malaysia, 15-–17 August 2016, Proceedings. Universiti Teknologi Malaysia, Johor Bahru, Malaysia, 2016, 418–420.
MARKUS HOLZER, BIANCA TRUTHE:: On relations between some subregular language families.
In: RUDOLF FREUND, MARKUS HOLZER, NELMA MOREIRA, ROGÉRIO REIS (eds.), 7th 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, Austria, 2015, 109–124.
MARKUS HOLZER, BIANCA TRUTHE:: Zu Beziehungen zwischen subregulären Sprachfamilien.
In: HENNING FERNAU (ed.), 25. Theorietag `Automaten und Formale Sprachen', Speyer, 29. September – 2. Oktober 2015. Technical Reports Mathematics/Computer Science Technical Report No. 15-1, Universität Trier, 2015, 67–70.
BIANCA TRUTHE:: A Relation Between Definite and Ordered Finite Automata.
In: SUNA BESCH, RUDOLF FREUND, FRIEDRICH OTTO (eds.), 6th Workshop on Non-Classical Models of Automata and Applications (NCMA), Kassel, Germany, July 28–29, 2014, Proceedings. books@ocg.at 304, Österreichische Computer Gesellschaft, Austria, 2014, 235–247.
BIANCA TRUTHE:: A Relation Between Definite and Ordered Finite Automata.
In: HENNING BORDIHN, BIANCA TRUTHE (eds.), 24. Theorietag `Automaten und Formale Sprachen', Caputh, 23.–25. September 2014. Berichte Institut für Informatik und Computational Science TR-2014-2, Universität Potsdam, 2014, 89–92.
BIANCA TRUTHE:: Chains of Evolutionary Processors with Random Context Filters.
In: SUNA BESCH, FRANK DREWES, RUDOLF FREUND, FRIEDRICH OTTO (eds.), Fifth Workshop on Non-Classical Models of Automata and Applications (NCMA), Umeå, Sweden, August 13–14, 2013, Proceedings. books@ocg.at 294, Österreichische Computer Gesellschaft, Austria, 2013, 225–241.
BIANCA TRUTHE:: Ketten evolutionärer Prozessoren mit Random-Context-Filtern.
In: DIETRICH KUSKE (ed.), 23. Theorietag `Automaten und Formale Sprachen', Ilmenau, Germany, September 25–27, 2013. Proceedings. Technische Universität Ilmenau, 2013, 14–16.
JÜRGEN DASSOW, BIANCA TRUTHE:: Extended Splicing Systems with Subregular Sets of Splicing Rules.
In: RUDOLF FREUND, MARKUS HOLZER, BIANCA TRUTHE, ULRICH ULTES-NITSCHE (eds.), Fourth Workshop on Non-Classical Models of Automata and Applications (NCMA), Fribourg, Switzerland, August 23–24, 2012, Proceedings. books@ocg.at 290, Österreichische Computer Gesellschaft, Austria, 2012, 65–78.
FLORIN MANEA, BIANCA TRUTHE:: On Internal Contextual Grammars with Subregular Selection Languages.
In: 14th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2012, Braga, Portugal, July 23–25, 2012, Proceedings. LNCS 7386, Springer, 2012, 222–235.
FLORIN MANEA, BIANCA TRUTHE:: On Internal Contextual Grammars with Subregular Selection Languages.
In: FRANTIŠEK MRÁZ (ed.), 22nd Theorietag `Automata and Formal Languages', Prague, Czech Republic, October 3–5, 2012. Proceedings. Charles University in Prague, Fakulty of Mathematics and Physics, 2012, 103–108.
JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:: Generating Networks of Splicing Processors.
In: RUDOLF FREUND, MARKUS HOLZER, CARLO MEREGHETTI, FRIEDRICH OTTO, BEATRICE PALANO (eds.), Third Workshop on Non-Classical Models of Automata and Applications (NCMA), Milano, Italy, July 18–19, 2011, Proceedings. books@ocg.at 282, Österreichische Computer Gesellschaft, Austria, 2011, 121–136.
JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:: Networks of Evolutionary Processors with Subregular Filters.
In: ADRIAN HORIA DEDIU, SHUNSUKE INENAGA, CARLOS MARTÍN-VIDE (eds.), Language and Automata Theory and Applications. Fifth International Conference, LATA 2011, Tarragona, Spain, May 26 – 31, 2011. LNCS 6638, Springer, 2011, 262–273.
JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:: Netze evolutionärer Prozessoren mit subregulären Filtern.
In: JÜRGEN DASSOW, BIANCA TRUTHE (eds.), 21. Theorietag `Automaten und Formale Sprachen', Allrode (Harz), 27.–29.9.2011, Tagungsband. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2011, 29–32.
JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:: On Contextual Grammars with Subregular Selection Languages.
In: MARKUS HOLZER, MARTIN KUTRIB, GIOVANNI PIGHIZZINI (eds.), 13th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2011, Gießen, Germany, July 25–27, 2011, Proceedings. LNCS 6808, Springer, 2011, 135–146.
JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:: On Normal Forms for Networks of Evolutionary Processors.
In: JARKKO KARI, ION PETRE (eds.), Unconventional Computation. 10th International Conference, UC 2011, Turku, Finland, June 6 – 10, 2011. LNCS 6714, Springer, 2011, 89–100.
FLORIN MANEA, BIANCA TRUTHE:: Accepting Networks of Evolutionary Processors with Subregular Filters.
In: PÁL DÖMÖSI, SZABOLCS IVÁN (eds.), Automata and Formal Languages – 13th International Conference AFL 2011, Debrecen, Hungary, August 17–22, 2011, Proceedings. College of Nyíregyháza, 2011, 300–314.
JÜRGEN DASSOW, BIANCA TRUTHE:: On Networks of Evolutionary Processors with State Limited Filters.
In: HENNING BORDIHN, RUDOLPH FREUND, THOMAS HINZE, MARKUS HOLZER, MARTIN KUTRIB, FRIEDRICH OTTO (eds.), Second Workshop on Non-Classical Models of Automata and Applications (NCMA), Jena, Germany, August 23–24, 2010, Proceedings. books@ocg.at 263, Österreichische Computer Gesellschaft, Austria, 2010, 57–70.
BIANCA TRUTHE:: On the Descriptional Complexity of Limited Propagating Lindenmayer Systems.
In: IAN MCQUILLAN, GIOVANNI PIGHIZZINI, BRETT TROST (eds.), 12th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Saskatchewan, Canada, August 8–10, 2010, Proceedings. Technical Report 2010-02, University of Saskatchewan, Department of Computer Science, 2010, 215–226.
BIANCA TRUTHE:: On the Descriptional Complexity of Limited Propagating Lindenmayer Systems.
In: IAN MCQUILLAN, GIOVANNI PIGHIZZINI (eds.), 12th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Saskatchewan, Canada, August 8–10, 2010, Proceedings. EPTCS 31, Open Publishing Association, 2010, 177–188.
BIANCA TRUTHE:: On the Descriptional Complexity of Limited Propagating Lindenmayer Systems.
In: MARCEL VOLLWEILER FRIEDRICH OTTO, NORBERT HUNDESHAGEN (ed.), 20. Theorietag der GI-Fachgruppe AFS `Automaten und Formale Sprachen', Baunatal bei Kassel, 29.9.–-1.10.2010. Technical Report 2010/03, Universität Kassel, 2010, 122–128.
VICTOR MITRANA, BIANCA TRUTHE:: On Accepting Networks of Evolutionary Processors With at Most Two Types of Nodes.
In: CARLOS MARTÍN-VIDE, ADRIAN HORIA DEDIU, MIHAI IONESCU (eds.), Language and Automata Theory and Applications. Third International Conference, LATA 2009, Tarragona, Spain, April 2 – 8, 2009. LNCS 5457, Springer, 2009, 588–600.
BIANCA TRUTHE:: Target Based Accepting Networks of Evolutionary Processors with Regular Filters.
In: HENNING BORDIHN, RUDOLPH FREUND, MARKUS HOLZER, MARTIN KUTRIB, FRIEDRICH OTTO (eds.), Workshop on Non-Classical Models of Automata and Applications (NCMA), Wrocław, Poland, August 31 – September 1, 2009, Proceedings. books@ocg.at 256, Österreichische Computer Gesellschaft, Austria, 2009, 221–236.
BIANCA TRUTHE:: Ziel basierte akzeptierende Netzwerke evolutionärer Prozessoren mit regulären Filtern.
In: JÖRAN MIELKE, LUDWIG STAIGER, RENATE WINTER (eds.), Theorietag Automaten und Formale Sprachen 2009, Wittenberg, 27. bis 30. September 2009. Technical Report 2009/03, Martin-Luther-Universität Halle-Wittenberg, Institut für Informatik, 2009, 53–54.
JÜRGEN DASSOW, BIANCA TRUTHE:: On Two Hierarchies of Subregularly Tree Controlled Languages.
In: CEZAR CÂMPEANU, GIOVANNI PIGHIZZINI (eds.), 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16–18, 2008, Proceedings. University of Prince Edward Island, 2008, 145–156.
JÜRGEN DASSOW, BIANCA TRUTHE:: Subregularly Tree Controlled Grammars and Languages.
In: ERZSÉBET CSUHAJ-VARJÚ, ZOLTÁN ESIK (eds.), Automata and Formal Languages – 12th International Conference AFL 2008, Balatonfüred, Hungary, May 27–30, 2008, Proceedings. Computer and Automation Research Institute of the Hungarian Academy of Sciences, 2008, 158–169.
BIANCA TRUTHE:: On Small Accepting Networks of Evolutionary Processors with Regular Filters.
In: Colloquium on the Occasion of the 50th Birthday of Victor Mitrana. Proceedings. Otto-von-Guericke-Universität Magdeburg, Germany, 2008, 37–52.
BIANCA TRUTHE:: Zu akzeptierenden Netzwerken evolutionärer Prozessoren mit zwei Knotenarten.
In: MARKUS HOLZER, MARTIN KUTRIB, ANDREAS MALCHER (eds.), 18. Theorietag Automaten und Formale Sprachen, Wettenberg-Launsbach, 30. September – 2. Oktober 2008, Proceedings. Justus-Liebig-Universität Gießen, Germany, 2008, 121–128.
JÜRGEN DASSOW, BIANCA TRUTHE:: On the Power of Networks of Evolutionary Processors.
In: JÉRÔME DURAND-LOSE, MAURICE MARGENSTERN (eds.), Machines, Computations and Universality, MCU 2007, Orléans, France, September 10–13, 2007, Proceedings. LNCS 4664, Springer, 2007, 158–169.
JÜRGEN DASSOW, BIANCA TRUTHE:: Zur Mächtigkeit von Netzwerken evolutionärer Prozessoren mit zwei Knotenarten.
In: MANFRED DROSTE, MARKUS LOHREY (eds.), 17. Theorietag Automaten und Formale Sprachen, Leipzig, 27.–29. September 2007, Proceedings. Universität Leipzig, 2007, 38–44.
BIANCA TRUTHE:: Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements.
In: VILIAM GEFFERT, GIOVANNI PIGHIZZINI (eds.), 9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007, Novy Smokovec, Slovakia, July 20–23, 2007, Proceedings. University Košice, 2007, 141–152.
JÜRGEN DASSOW, BIANCA TRUTHE:: Kontextfreie PC-Grammatiksysteme zum Erzeugen einer Sprache mit Verschränkung.
In: RUDOLF FREUND, MARION OSWALD (eds.), 16. Theorietag Automaten und Formale Sprachen, Wien, 27.–29. September 2006, Proceedings. TU Wien, Austria, 2006, 40–45.
JÜRGEN DASSOW, BIANCA TRUTHE:: On the degree complexity of special non-context-free languages with respect to PC grammar systems.
In: HING LEUNG, GIOVANNI PIGHIZZINI (eds.), 8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006, Las Cruces, NM, USA, June 21–23, 2006, Proceedings. Computer Science Technical Report NMSU-CS-2006-001, New Mexico State University Las Cruces, 2006, 241–249.
BIANCA TRUTHE:: Äquivalenz von Bildsprachen synchroner deterministischer Ketten-Code-Bild-Systeme.
In: HENNING FERNAU (ed.), 15. Theorietag Automaten und Formale Sprachen. Preprint WSI-2005-16, Universität Tübingen, 2005, 59–62.
BIANCA TRUTHE:: A Method for Deciding the Finiteness of Synchronous, Tabled Picture Languages.
In: ZOLTÁN ESIK, ZOLTÁN FÜLÖP (eds.), Automata and Formal Languages – 11th International Conference AFL 2005, Dobogókõ, Hungary, May 17–20, 2005, Proceedings. Institute of Informatics, University of Szeged, Hungary, 2005, 292–305.
BIANCA TRUTHE:: A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages.
In: CRISTIAN S. CALUDE, ELENA CALUDE, MICHAEL J. DINNEEN (eds.), Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13–17, 2004, Proceedings. LNCS 3340, Springer, 2004, 406–417.
BIANCA TRUTHE:: Zur Endlichkeit von Bildsprachen zu tabellierten Ketten-Code-Bild-Systemen.
In: SUNA BENSCH, OLIVER BOLDT, HENNING BORDIHN, HELMUT JÜRGENSEN (eds.), 14. Theorietag Automaten und Formale Sprachen. Preprint 2/2004, Institut für Informatik, Universität Potsdam, 2004, 135–139.
BIANCA TRUTHE:: Zur Endlichkeit von Bildsprachen synchroner, deterministischer Ketten-Code-Bild-Systeme.
In: FRIEDRICH OTTO, GUNDULA NIEMANN (eds.), 9. Theorietag Automaten und Formale Sprachen. Mathematische Schriften Kassel 12/1999, Universität Gesamthochschule Kassel, Fachbereich Mathematik/Informatik, 1999, 57–58.

50 matches found.

Search results for author `Truthe'

2023

2022

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

1999