Document Search Results

Holík, Lukáš; Síč, Juraj; Turoňová, Lenka; Vojnar, Tomáš

Fast matching of regular patterns with synchronizing counting. (English) Zbl 07770347

Kupferman, Orna (ed.) et al., Foundations of software science and computation structures. 26th international conference, FOSSACS 2023, held as part of the European joint conferences on theory and practice of software, ETAPS 2023, Paris, France, April 22–27, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13992, 392-412 (2023).

MSC: 68Nxx 68Qxx

Cite Review PDF

Full Text: DOI arXiv

OA License

Abiteboul, S.; Gottlob, G.; Manna, M.

Distributed XML design. (English) Zbl 1246.68066

J. Comput. Syst. Sci. 77, No. 6, 936-964 (2011).

Reviewer: Jaroslav Pokorný (Praha)

MSC: 68M11 68M14 68P15 68Q17

Cite Review PDF

Full Text: DOI arXiv

Lifshits, Yuri

A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression. (English) Zbl 1173.68555

Inf. Process. Lett. 85, No. 6, 293-299 (2003).

MSC: 68Q45

Cite Review PDF

Full Text: DOI

Hromkovič, Juraj; Seibert, Sebastian; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg

Communication complexity method for measuring nondeterminism in finite automata. (English) Zbl 1009.68067

Inf. Comput. 172, No. 2, 202-217 (2002).

MSC: 68Q45 68Q17 68Q10

Cite Review PDF

Full Text: DOI

Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas

Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata. (English) Zbl 1014.68093

J. Comput. Syst. Sci. 62, No. 4, 565-588 (2001).

MSC: 68Q45

Cite Review PDF

Full Text: DOI Link

Ponty, J.-L.

An efficient null-free procedure for deciding regular language membership. (English) Zbl 0953.68074

Theor. Comput. Sci. 231, No. 1, 89-101 (2000).

MSC: 68Q45

Cite Review PDF

Full Text: DOI

Henriksen, Jesper G.; Thiagarajan, P. S.

Dynamic linear time temporal logic. (English) Zbl 0931.03033

Ann. Pure Appl. Logic 96, No. 1-3, 187-207 (1999).

MSC: 03B44 03B70 03D05 68Q60

Cite Review PDF

Full Text: DOI

Brüggemann-Klein, Anne; Wood, Derick

One-unambiguous regular languages. (English) Zbl 0912.68112

Inf. Comput. 142, No. 2, 182-206 (1998).

MSC: 68Q45

Cite Review PDF

Full Text: DOI Link

Henriksen, Jesper G.; Thiagarajan, P. S.

A product version of dynamic linear time temporal logic. (English) Zbl 1512.68156

Mazurkiewicz, Antoni (ed.) et al., CONCUR ’97: concurrency theory. 8th international conference. Warsaw, Poland. July 1–4, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1243, 45-58 (1997).

MSC: 68Q60 03B44 68Q45 68Q85

Cite Review PDF

Full Text: DOI

Found 9 Documents (Results 1–9)

Fast matching of regular patterns with synchronizing counting. (English) Zbl 07770347

Distributed XML design. (English) Zbl 1246.68066

A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression. (English) Zbl 1173.68555

Communication complexity method for measuring nondeterminism in finite automata. (English) Zbl 1009.68067

Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata. (English) Zbl 1014.68093

An efficient null-free procedure for deciding regular language membership. (English) Zbl 0953.68074

Dynamic linear time temporal logic. (English) Zbl 0931.03033

One-unambiguous regular languages. (English) Zbl 0912.68112

A product version of dynamic linear time temporal logic. (English) Zbl 1512.68156

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field

Software